Generalized binomial states: ladder operator approach
نویسندگان
چکیده
منابع مشابه
Generalized Binomial States: Ladder Operator Approach
We show that the binomial states (BS) of Stoler et al. admit the ladder and displacement operator formalism. By generalizing the ladder operator formalism we propose an eigenvalue equation which possesses the number and the squeezed states as its limiting solutions. The explicit forms of the solutions, to be referred to as the generalized binomial states (GBS), are given. Corresponding to the w...
متن کاملQuantum Computation with Generalized Binomial States in Cavity Quantum Electrodynamics
Cavity quantum electrodynamics (CQED) has been shown to be suitable to quantum computation processing1 thanks to the high quality factors Q of cavities, control of atom-cavity interactions and long lifetimes of Rydberg atoms2. In this context, the information can be stored and processed by atoms and photons representing the quantum bits (qubits)3 and two approaches can be distinct: the “microwa...
متن کاملGeneralized states on EQ-algebras
In this paper, we introduce a notion of generalized states from an EQ-algebra E1 to another EQ-algebra E2, which is a generalization of internal states (or state operators) on an EQ-algebra E. Also we give a type of special generalized state from an EQ-algebra E1 to E1, called generalized internal states (or GI-state). Then we give some examples and basic properties of generalized (internal) st...
متن کاملLadder operator formalisms and generally deformed oscillator algebraic structures of quantum states in Fock space
We show that various kinds of one-photon quantum states studied in the field of quantum optics admit ladder operator formalisms and have the generally deformed oscillator (GDO) algebraic structure. The two-photon case is also considered. We obtain the ladder operator formalisms of two general states defined in the even/odd Fock space. The two-photon states may also have a GDO algebraic structur...
متن کاملChromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for the chromatic polynomial of a graph of this type is proven. Finally, the chromatic polynomials of special cases of these graphs are explicitly computed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and General
سال: 1996
ISSN: 0305-4470,1361-6447
DOI: 10.1088/0305-4470/29/17/034